Decidability of regular language genus computation
نویسندگان
چکیده
منابع مشابه
Decidability of regular language genus computation
The article continues the study of the genus of regular languages that the author introduced in a 2012 paper. We show that the minimal finite deterministic automaton of a regular language can be arbitrary far away from a finite deterministic automaton realizing the minimal genus and computing the same language both in terms of the difference of genera and in terms of the difference in size. How...
متن کاملDecidability of Geometricity of Regular Languages
Geometrical languages generalize languages introduced to model temporal validation of real-time softwares. We prove that it is decidable whether a regular language is geometrical. This result was previously known for binary languages.
متن کاملThe genus of regular languages
The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its underlying language. It is then natural to make a connection between the languages and the notion of genus. After we introduce and justify the the notion of the gen...
متن کاملOn Decidability of Hierarchies of Regular Aperiodic Languages
In automata theory, several natural hierarchies of regular languages are studied. Among the most popular are hierarchies of Brzozowski and Straubing (see e.g [11]), both exhausting the class of so called regular aperiodic (or star–free) languages. A natural question about these hierarchies is formulated as follows: given a level of a hierarchy and a finite automaton, one has to decide effective...
متن کاملOn decidability of boundedness property for regular path queries
The paper studies the evaluation of regular path queries on semi-structured data, i.e. path queries of the form nd all objects reachable by path whose labels form a word in p where p is a regular expression. We use local information expressed in the form of path inclusions in the optimization of path queries. These constraints are of the form L v where L is a regular language and v is a word; L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2019
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129519000057